- heuristic criterion
- эвристический критерий
Англо-русский словарь по исследованиям и ноу-хау. Е.Г. Коваленк. 2015.
Англо-русский словарь по исследованиям и ноу-хау. Е.Г. Коваленк. 2015.
Heuristic — (hyu̇ ˈris tik) is a method to help solve a problem, commonly an informal method. It is particularly used to rapidly come to a solution that is reasonably close to the best possible answer, or optimal solution . Heuristics are rules of thumb ,… … Wikipedia
Recognition heuristic — The recognition heuristic has been used as a model in the psychology of judgment and decision making and as a heuristic in artificial intelligence. It states: [Goldstein, D. G., Gigerenzer, G. (2002). Models of ecological rationality: The… … Wikipedia
Take-the-best heuristic — According to the take the best heuristic, when making a judgment based on multiple criteria, the critieria are tried one at a time according to their cue validity, and a decision is made based on the first criterion which discriminates between… … Wikipedia
Occam's razor — For the aerial theatre company, see Ockham s Razor Theatre Company. It is possible to describe the other planets in the solar system as revolving around the Earth, but that explanation is unnecessarily complex compared to the modern consensus… … Wikipedia
Minimax — This article is about the decision theory concept. For other uses, see Minimax (disambiguation). Minimax (sometimes minmax) is a decision rule used in decision theory, game theory, statistics and philosophy for minimizing the possible loss for a… … Wikipedia
Exact sciences (The) in Hellenistic times: texts and issues — The exact sciences in Hellenistic times: Texts and issues1 Alan C.Bowen Modern scholars often rely on the history of Greco Latin science2 as a backdrop and support for interpreting past philosophical thought. Their warrant is the practice… … History of philosophy
Imre Lakatos — For other people with the same name, see Lakatos (disambiguation). Imre Lakatos Imre Lakatos, c. 1960s Full name Imre Lakatos Born November 9, 1922 Debrecen, Hungary … Wikipedia
Ant colony optimization algorithms — Ant behavior was the inspiration for the metaheuristic optimization technique. In computer science and operations research, the ant colony optimization algorithm (ACO) is a probabilistic technique for solving computational problems which can be… … Wikipedia
Nucleic acid design — can be used to create nucleic acid complexes with complicated secondary structures such as this four arm junction. These four strands associate into this structure because it maximizes the number of correct base pairs, with A s matched to T s and … Wikipedia
Genetic algorithm — A genetic algorithm (GA) is a search heuristic that mimics the process of natural evolution. This heuristic is routinely used to generate useful solutions to optimization and search problems. Genetic algorithms belong to the larger class of… … Wikipedia
Computational phylogenetics — is the application of computational algorithms, methods and programs to phylogenetic analyses. The goal is to assemble a phylogenetic tree representing a hypothesis about the evolutionary ancestry of a set of genes, species, or other taxa. For… … Wikipedia